NEARLY ANTIPODAL CHROMATIC NUMBER ac′(Pn) OF THE PATH Pn

نویسندگان

  • Srinivasa Rao Kola
  • Pratima Panigrahi
چکیده

Chartrand et al. (2004) have given an upper bound for the nearly antipodal chromatic number ac′(Pn) as (n−2 2 ) +2 for n > 9 and have found the exact value of ac′(Pn) for n = 5, 6, 7, 8. Here we determine the exact values of ac′(Pn) for n > 8. They are 2p − 6p + 8 for n = 2p and 2p − 4p + 6 for n = 2p + 1. The exact value of the radio antipodal number ac(Pn) for the path Pn of order n has been determined by Khennoufa and Togni in 2005 as 2p− 2p+3 for n = 2p+1 and 2p− 4p+5 for n = 2p. Although the value of ac(Pn) determined there is correct, we found a mistake in the proof of the lower bound when n = 2p (Theorem 6). However, we give an easy observation which proves this lower bound.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Improved upper bounds for nearly antipodal chromatic number of paths

For paths Pn, G. Chartrand, L. Nebeský and P. Zhang showed that ac′(Pn) ≤ ( n−2 2 ) +2 for every positive integer n, where ac′(Pn) denotes the nearly antipodal chromatic number of Pn. In this paper we show that ac′(Pn) ≤ ( n−2 2 ) − n2 − b 10 n c + 7 if n is even positive integer and n ≥ 10, and ac′(Pn) ≤ ( n−2 2 ) − n−1 2 − b 13 n c + 8 if n is odd positive integer and n ≥ 13. For all even pos...

متن کامل

On Radio ( n − 4 ) - chromatic Number of the Path P n

For a path Pn of order n, Chartrand et al. [3] have given an upper bound for radio k-chromatic number when 1 ≤ k ≤ n−1. Liu and Zhu [7] have determined the exact value of radio (n−1)-chromatic number of Pn, namely radio number, rn(Pn), when n ≥ 3. Khennoufa and Togni [5] have given the exact value of radio (n − 2)-chromatic number of Pn, namely antipodal number, ac(Pn), when n ≥ 5. Kola and Pan...

متن کامل

Radio Antipodal Colorings of Graphs

A radio antipodal coloring of a connected graph G with diameter d is an assignment of positive integers to the vertices of G, with x ∈ V (G) assigned c(x), such that d(u, v) + |c(u) − c(v)| d for every two distinct vertices u, v of G, where d(u, v) is the distance between u and v in G. The radio antipodal coloring number ac(c) of a radio antipodal coloring c of G is the maximum color assigned t...

متن کامل

Line completion number of grid graph Pn × Pm

The concept of super line graph was introduced in the year 1995 by Bagga, Beineke and Varma. Given a graph with at least r edges, the super line graph of index r, Lr(G), has as its vertices the sets of r-edges of G, with two adjacent if there is an edge in one set adjacent to an edge in the other set. The line completion number lc(G) of a graph G is the least positive integer r for which Lr(G) ...

متن کامل

Coloring Variations of the Art Gallery Problem

The art gallery problem [2] asks for the smallest possible size of a point set S (the guards) to completely guard the interior of a simple polygon P (the art gallery). This thesis treats variations of the original problem that arise when we introduce a coloring of the guards. Rather than asking for the minimum number of guards we ask for the minimum number of colors. In [4] L. H. Erickson and S...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009